NightSplitter: A Scheduling Tool to Optimize (Sub)group Activities
نویسندگان
چکیده
Humans are social animals and usually organize activities in groups. However, they are often willing to split temporarily a bigger group in subgroups to enhance their preferences. In this work we present NightSplitter, an on-line tool that is able to plan movie and dinner activities for a group of users, possibly splitting them in subgroups to optimally satisfy their preferences. We first model and prove that this problem is NP-complete. We then use Constraint Programming (CP) or alternatively Simulated Annealing (SA) to solve it. Empirical results show the feasibility of the approach even for big cities where hundreds of users can select among hundreds of movies and thousand of restaurants.
منابع مشابه
Modified Pareto archived evolution strategy for the multi-skill project scheduling problem with generalized precedence relations
In this research, we study the multi-skill resource-constrained project scheduling problem, where there are generalized precedence relations between project activities. Workforces are able to perform one or several skills, and their efficiency improves by repeating their skills. For this problem, a mathematical formulation has been proposed that aims to optimize project completion time, reworki...
متن کاملIntegrating Network Technique into Distributed Agent-Oriented Software Development Projects
The management of local software projects is challenging, due to its complexity. In case of distributed development projects, the complexity in project management increases even more [1]. In this publication we introduce and adapt the well-proven network technique into Paose, a distributed agent-oriented software development approach, by directly integrating a modeling tool for network techniqu...
متن کاملA Flexible Job Shop Scheduling Problem with Controllable Processing Times to Optimize Total Cost of Delay and Processing
In this paper, the flexible job shop scheduling problem with machine flexibility and controllable process times is studied. The main idea is that the processing times of operations may be controlled by consumptions of additional resources. The purpose of this paper to find the best trade-off between processing cost and delay cost in order to minimize the total costs. The proposed model, flexibl...
متن کاملConstrained Renewable Resource Allocation in Fuzzy Metagraphs via Min-Slack
This paper discusses that the fuzzy metagraphs can be used as a tool for scheduling and control of fuzzy projects. Often, available resources for executing projects may be limited. It is assumed the resources required to accomplish each activity of project (metagraph edges) is renewable. One of the common methods for scheduling projects is using the min-slack. So, first, the forward and bac...
متن کاملAn Optimal NPV Project Scheduling with Fixed Work Content and Payment on Milestones
Project scheduling Net present value We consider a project scheduling problem with permitted tardiness and discrete time/resource trade-offs under maximum net present value objective. In this problem, a project consists of a set of sequential phases such that each phase contains one or more sub-projects including activities interrelated by finish-start-type precedence relations with a t...
متن کامل